A Better and Efficient DNA DATA COMPRESSOR by Fusion of Symbolical and ARLE Technique

Data compression is concerned with how information is organized in data. The size and importance of these databases will be bigger and bigger in the future; therefore this information must be stored or communicated efficiently though there are many text compression algorithms, they are not well suited for the characteristics of DNA sequences. There are algorithms for DNA compression which takes advantage of repetitive nature of DNA fragments within the sequence whereas few of the other algorithms are written for the non-repeated patterns within DNA sequences. We present a compression algorithm, “DNA DATA Compressor” for DNA sequences based on amalgamation of unparalleled symbolic representation with combination of ARLE (Altered Run length Encoding) technique. The proposed technique is very simpleton and efficient for the DNA compression. The proposed algorithm performs equally well for both repeated and non-repeated patterns within the DNA sequence. We have also defined the Worst case, Average case and Best case for DNA compression using our proposed Algorithm. Assigning symbolic representation along with ARLE technique for fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression.